Customer satisfaction in dynamic vehicle routing problem with time windows

The dynamic vehicle routing and scheduling problem is a well-known complex combinatorial optimization problem that drew significant attention over the past few years. This paper presents a novel algorithm introducing a new strategy to integrate anticipated future visit requests during plan generation, aimed vailable online xxx eywords: enetic algorithms ustomer satisfaction at explicitly improving customer satisfaction. An evaluation of the proposed strategy is performed using a hybrid genetic algorithm previously designed for the dynamic vehicle problem with time windows that we modified to capture customer satisfaction over multiple visits. Simulations compare the value of the revisited algorithm exploiting the new strategy, clearly demonstrating its impact on customer satisfaction level. Q4 42 43 44 45 46 47 48 49 50 51 52